Quadrangulations and 5-critical Graphs on the Projective Plane
نویسنده
چکیده
Let Q be a nonbipartite quadrangulation of the projective plane. Youngs [13] proved that Q cannot be 3-colored. We prove that for every 4-coloring of Q and for any two colors a and b, the number of faces F of Q, on which all four colors appear and colors a and b are not adjacent on F , is odd. This strengthens previous results that have appeared in [13, 6, 8, 1]. If we form a triangulation of the projective plane by inserting a vertex of degree 4 in every face of Q, we obtain an Eulerian triangulation T of the projective plane whose chromatic number is 5. The above result shows that T is never 5-critical. We show that sometimes one can remove two, three, or four, vertices from T and obtain a 5-critical graph. This gives rise to an explicit construction of 5-critical graphs on the projective plane and yields the first explicit family of 5-critical graphs with arbitrarily large edge-width on a fixed surface.
منابع مشابه
A binary labeling for plane Laman graphs and quadrangulations
We present binary labelings for the angles of quadrangulations and plane Laman graphs, which are in analogy with Schnyder labelings for triangulations [W. Schnyder, Proc. 1st ACM-SIAM Symposium on Discrete Algorithms, 1990] and imply a special tree decomposition for quadrangulations. In particular, we show how to embed quadrangulations on a 2-book, so that each page contains a non-crossing alte...
متن کاملA binary labelling for plane Laman graphs and quadrangulations
We provide binary labellings for the angles of quadrangulations and plane Laman graphs which are in analogy with Schnyder labellings for triangulations [W. Schnyder, Proc. 1st ACM-SIAM Symposium on Discrete Algorithms, 1990].
متن کاملQuadrangulations of the projective plane are t-perfect if and only if they are bipartite
We show that every non-bipartite quadrangulation of the projective plane contains an odd wheel as a t-minor and is thus t-imperfect.
متن کاملCube-contractions in 3-connected quadrangulations
A 3-connected quadrangulation of a closed surface is said to be K′ 3-irreducible if no faceor cube-contraction preserves simplicity and 3-connectedness. In this paper, we prove that a K′ 3-irreducible quadrangulation of a closed surface except the sphere and the projective plane is either (i) irreducible or (ii) obtained from an irreducible quadrangulation H by applying 4-cycle additions to F0 ...
متن کاملBinary Labelings for Plane Quadrangulations and their Relatives
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our labeling resembles many of the properties of Schnyder’s one for triangulations: Apart from being in bijection with tree decompositions, paths in these trees allow ...
متن کامل